|
In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space. == Formal definition == If we denote by SPACE(''t''(''n'')), the set of all problems that can be solved by Turing machines using ''O''(''t''(''n'')) space for some function ''t'' of the input size ''n'', then we can define PSPACE formally as〔Arora & Barak (2009) p.81〕 : PSPACE is a strict superset of the set of context-sensitive languages. It turns out that allowing the Turing machine to be nondeterministic does not add any extra power. Because of Savitch's theorem,〔Arora & Barak (2009) p.85〕 NPSPACE is equivalent to PSPACE, essentially because a deterministic Turing machine can simulate a non-deterministic Turing machine without needing much more space (even though it may use much more time).〔Arora & Barak (2009) p.86〕 Also, the complements of all problems in PSPACE are also in PSPACE, meaning that co-PSPACE = PSPACE. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「PSPACE」の詳細全文を読む スポンサード リンク
|